منابع مشابه
A push-pull queueing system
We consider a two node multiclass queueing network given by two machines each with two classes. There are two streams of jobs: One stream originates in machine 1, which feeds it for further processing to machine 2, and the other stream moves in the opposite direction. We describe a policy for this system which is stable and which keeps both machines busy at all times. We obtain explicit express...
متن کاملUsing Speculative Push for Unnecessary Checkpoint Creation Avoidance
This paper discusses a way of incorporating speculation techniques into Distributed Shared Memory (DSM) systems with checkpointing mechanism without creating unnecessary checkpoints. Speculation is a general technique involving prediction of the future of a computation, namely accesses to shared objects unavailable on the accessing node (read faults). Thanks to such predictions objects can be p...
متن کاملWhen queueing is better than push and shove
We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that existing property rights for the service are small enough to enable trade between the agents. In particul...
متن کاملApproximate Analysis of a Multi-Class Open Queueing Network with Class Blocking and Push-out
We study a multi-class queueing network which consists of a finite capacity node (node 0) linked to M parallel finite capacity nodes (nodes 1 to M). M classes of customers are assumed. All customers first join node O. A class i customer after completion of its service at node °always joins the ith node. All service times and inter-arrival times are assumed to be exponentially distributed. The s...
متن کاملPositive harris recurrence and diffusion scale analysis of a push pull queueing network
We consider a push pull queueing system with two servers and two types of jobs which are processed by the two servers in opposite order, with stochastic generally distributed processing times. This push pull system was introduced by Kopzon and Weiss, who assumed exponential processing times. It is similar to the Kumar-Seidman Rybko-Stolyar (KSRS) multi-class queueing network, with the distincti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel Programming
سال: 2004
ISSN: 0885-7458
DOI: 10.1023/b:ijpp.0000029274.45582.a8